﻿    using System.Security.Cryptography;

    class Solution35
    {
        public int SearchInsert(int[] nums, int target)
        {

            int len = nums.Length;
            int left = 0;
            int right = len - 1;
            while (left < right)
            {

                int mid = (left + right) / 2;
                if (target < nums[mid])
                {

                    right = mid - 1;

                }
                else if (target > nums[mid])
                {
                    left = mid + 1;
                }
                else
                {
                    return mid;
                }

            }
            return left + 1;

        }
    }